﻿Feature extractionFrom Wikipedia, the free encyclopedia
Jump to: navigation, search 
In pattern recognition and in image processing, feature extraction is a special form of dimensionality reduction.

When the input data to an algorithm is too large to be processed and it is suspected to be notoriously redundant (much data, but not much information) then the input data will be transformed into a reduced representation set of features (also named features vector). Transforming the input data into the set of features is called feature extraction. If the features extracted are carefully chosen it is expected that the features set will extract the relevant information from the input data in order to perform the desired task using this reduced representation instead of the full size input.

Contents [hide]
1 General 
2 Image processing 
2.1 Low-level 
2.1.1 Curvature 
2.1.2 Image motion 
2.2 Shape Based 
2.3 Flexible methods 
3 Feature extraction in software 
4 References 
5 See also 
6 External links 
 
[edit] GeneralFeature extraction involves simplifying the amount of resources required to describe a large set of data accurately. When performing analysis of complex data one of the major problems stems from the number of variables involved. Analysis with a large number of variables generally requires a large amount of memory and computation power or a classification algorithm which overfits the training sample and generalizes poorly to new samples. Feature extraction is a general term for methods of constructing combinations of the variables to get around these problems while still describing the data with sufficient accuracy.

Best results are achieved when an expert constructs a set of application-dependent features. Nevertheless, if no such expert knowledge is available general dimensionality reduction techniques may help. These include:

Principal components analysis 
Semidefinite embedding 
Multifactor dimensionality reduction 
Nonlinear dimensionality reduction 
Isomap 
Kernel PCA 
Latent semantic analysis 
Partial least squares 
Independent component analysis 
[edit] Image processingIt can be used in the area of image processing which involves using algorithms to detect and isolate various desired portions or shapes (features) of a digitized image or video stream. It is particularly important in the area of optical character recognition

[edit] Low-levelEdge detection 
Corner detection 
Blob detection 
Ridge detection 
Scale-invariant feature transform 
[edit] CurvatureEdge direction, changing intensity, autocorrelation. 
[edit] Image motionMotion detection. Area based, differential approach. Optical flow. 
[edit] Shape BasedThresholding 
Blob extraction 
Template matching 
Hough transform 
Lines 
Circles/Ellipse 
Arbitrary shapes (Generalized Hough Transform) 
[edit] Flexible methodsDeformable, parameterized shapes 
Active contours (snakes) 
[edit] Feature extraction in softwareMany data analysis software systems provide for feature extraction and dimension reduction. Common numerical programming environments such as MATLAB, SciLab, NumPy and the R language provide some of the simpler feature extraction techniques (e.g. Principal Components Analysis) via built-in commands. More specific algorithms are often available as publicly-available scripts or third-party add-ons.

Data pre-processing is an often neglected but important step in the data mining process. The phrase "Garbage In, Garbage Out" is particularly applicable to data mining and machine learning projects. Data gathering methods are often loosely controlled, resulting in out-of-range values (e.g., Income: -100), impossible data combinations (e.g., Gender: Male, Pregnant: Yes), missing values, etc. Analyzing data that has not been carefully screened for such problems can produce misleading results. Thus, the representation and quality of data is first and foremost before running an analysis.[1]

If there is much irrelevant and redundant information present or noisy and unreliable data, then knowledge discovery during the training phase is more difficult. Data preparation and filtering steps can take considerable amount of processing time. Data pre-processing includes cleaning, normalization, transformation, feature extraction and selection, etc. The product of data pre-processing is the final training set. Kotsiantis et al. (2006) present a well-known algorithm for each step of data pre-processing.[2]

